Polynomial clone reducibility

Polynomial-clone reducibilities are generalizations of the truth-table reducibilities. A polynomial clone is a set of functions over a finite set X that is closed under composition and contains all the constant and projection functions. For a fixed polynomial clone C, a sequence B ∈ X is C-reducible to A ∈ X if there is an algorithm that computes B from A using only effectively selected functions from C. We show that if A is a Kurtz random sequence and C1 * C2 are distinct polynomial clones, then there is a sequence B that is C1-reducible to A but not C2-reducible to A. This implies a generalization of a result first proved by Lachlan for the case |X| = 2. We also show that the same result holds if Kurtz random is replaced by Kolmogorov-Loveland stochastic.